Majority-Rule Consensus of Phylogenetic Trees Obtained by Maximum-Likelihood Analysis

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Phylogenetic Trees Using Maximum Likelihood

Maximum likelihood methods are used to estimate the phylogenetic trees for a set of species. The probabilities of DNA base substitutions are modeled by continuous-time Markov chains. We use these probabilities to estimate which DNA bases would produce the data that we observe. The topology of the tree is also determined using base substitution probabilities and conditional likelihoods. Felsenst...

متن کامل

PAML 4: phylogenetic analysis by maximum likelihood.

PAML, currently in version 4, is a package of programs for phylogenetic analyses of DNA and protein sequences using maximum likelihood (ML). The programs may be used to compare and test phylogenetic trees, but their main strengths lie in the rich repertoire of evolutionary models implemented, which can be used to estimate parameters in models of sequence evolution and to test interesting biolog...

متن کامل

Majority-rule reduced consensus trees and their use in bootstrapping.

Bootstrap analyses are usually summarized with majority-rule component consensus trees. This consensus method is based on replicated components and, like all component consensus methods, it is insensitive to other kinds of agreement between trees. Recently developed reduced consensus methods can be used to summarize much additional agreement on hypothesised phylogenetic relationships among mult...

متن کامل

Majority Consensus and the Local Majority Rule

we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...

متن کامل

On the Robustness of Majority Rule and Rule by Consensus†

We show that simple majority rule satisfies the Pareto property, anonymity, neutrality, and (generic) transitivity on a bigger class of preference domains than any other voting rule. If we replace neutrality in the above list of properties with independence of irrelevant alternatives, then the corresponding conclusion holds for unanimity rule (rule by consensus). * Faculty of Economics and Poli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Molecular Biology and Evolution

سال: 1997

ISSN: 0737-4038,1537-1719

DOI: 10.1093/oxfordjournals.molbev.a025739